Overlapping Coalition Formation Game via Multi-Objective Optimization for Crowdsensing Task Allocation

نویسندگان

چکیده

With the rapid development of sensor technology and mobile services, service model crowd sensing (MCS) has emerged. In this model, user groups perceive data through carried terminal devices, thereby completing large-scale distributed tasks. Task allocation is an important link in MCS, but interests task publishers, users, platforms often conflict. Therefore, to improve performance MCS allocation, study proposes a repeated overlapping coalition formation game scheme based on multiple-objective particle swarm optimization (ROCG-MOPSO). The (OCF) used describe resource relationship between users tasks, design two strategies, allowing form coalitions for different Multi-objective optimization, other hand, strategy that considers multiple simultaneously problems. we use multi-objective algorithm adjust parameters OCF better balance thus obtain more optimal scheme. To verify effectiveness ROCG-MOPSO, conduct experiments dataset compare results with schemes related literature. experimental show our ROCG-MOPSO performs superiorly key indicators such as average revenue, platform completion rate, surplus resources.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Methods for Task Allocation via Agent Coalition Formation

Task execution in multi-agent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where each task should be attached to a group of agents that will perform the task. Task allocation to groups of agents is necessary when tasks cannot be performed by a single agent. However it may also be beneficial when gr...

متن کامل

Task Allocation Via Coalition Formation Among Autonomous Agents

Autonomous agents working in multi-agent environments may need to cooperate in order to ful ll tasks. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where each task should be attached to a group of agents which will perform the task. The allocation of tasks to groups of agents is necessary when tasks cannot be performed by a single agent. It may also...

متن کامل

Multi-agent Based Execution Environment for Task Allocation via Coalition Formation

This paper focuses on a solution to the problem of task allocation through coalition formation and presents the design and implementation of a framework for this purpose. The framework serves as a multi-agent execution environment where worker agents follow the Shehory-Kraus’s coalition formation algorithm to negotiate and form coalitions. Worker agents prefer to form an optimal coalition to ma...

متن کامل

Parallel multi-objective multi-robot coalition formation

Consider a system with M robots each having K resource types and N tasks having a vector of Kresource types. A coalition scheme represents a grouping of a given set of robots into disjoint subsets where each subset (coalition ) is assigned one task. Thus for N tasks we have N coalition schemes, represented as CS = {C1, C2,,....CN}, In this problem we have considered the following two conflictin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2023

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics12163454